dual approximation
英 [ˈdjuːəl əˌprɒksɪˈmeɪʃn]
美 [ˈduːəl əˌprɑːksɪˈmeɪʃn]
【计】对偶逼近
双语例句
- Research on the Applications of Dual Basis and Geometric Approximation in CAGD
CAGD中对偶基与几何逼近问题的应用研究 - Under the framework of semidefinite programming, an primal dual interior point algorithms for logarithmic Chebychev approximation problem is constructed.
介绍了半定规划的一般模型、最优性条件及求解半定规划问题的原始对偶势下降内点算法。 - A Class of Dual Subdivision Schemes with Two Parameters ( 3) Nurbs surface approximation using a iterative algorithm.
基于顶点分裂的逼近曲面细分法（3）采用叠代法进行NURBS曲面逼近； - Different classes of rough fuzzy set algebra are obtained from different types of binary crisp relations. In the axiomatic approach, one defines a pair of dual rough fuzzy approximation operators and states that axioms must be satisfied by the operators.
在公理化方法中，用公理形式定义了粗糙模糊近似算子，各种类型的粗糙模糊集代数可以被各种不同的公理集所刻画。 - Dual and Approximation Method to Topological Optimization of Trusses
桁架结构拓扑优化的对偶逼近方法 - According to the dual theory, the dual programming was used to map the original problem exactly and the second approximation of the dual problem was set up by Taylor's expansion.
根据对偶理论，应用对偶规划精确映射原问题，再按泰勒展式建立对偶问题的二阶近似。 - In this paper, we first show the wrong definitions for two pairs of dual rough approximation operators in [ 4], then give the correct versions, at the same time, study the properties of the approximation operators.
指出了文献[4]中两类对偶粗糙近似算子定义的错误，并给出了正确的定义.同时讨论了近似算子的性质。到底哪一种说法合理？ - Modifications of Definitions for Two Pairs of Dual Rough Approximation Operators
关于两类对偶粗糙近似算子定义的修正 - Third, the dual scaling function is interpolating, which again is helpful for data approximation.
对偶尺度函数是插值的，插值性更利于数据逼近。 - And the result indicates that rough sets theory processes the uncertainty knowledge by a pair of dual rough approximation operator and gives attention to the virtual part and the real part of entirety space synchronously.
研究表明，粗糙集理论兼顾了完全空间中的虚实二象，通过一对对偶近似算子来处理知识的不确定性问题。 - The main idea is to transform the constrained dual program of the best rank-one approximation problems of tensors into a successive unconstrained optimization problems.
该算法的主要思想是把张量最佳秩一逼近的带约束的对偶问题转化成一系列的无约束优化问题。